Stochastic ordering of classical discrete distributions
نویسندگان
چکیده
For several pairs (P,Q) of classical distributions on N0, we show that their stochastic ordering P ≤st Q can be characterized by their extreme tail ordering equivalent to P ({k∗})/Q({k∗}) ≤ 1 ≤ limk→k∗ P ({k})/Q({k}), with k∗ and k∗ denoting the minimum and the supremum of the support of P + Q, and with the limit to be read as P ({k∗})/Q({k∗}) for k∗ finite. This includes in particular all pairs where P and Q are both binomial (bn1,p1 ≤st bn2,p2 if and only if n1 ≤ n2 and (1− p1) n1 ≥ (1− p2) , or p1 = 0), both negative binomial (b − r1,p1 ≤st b−r2,p2 if and only if p1 ≥ p2 and p r1 1 ≥ p2 2 ), or both hypergeometric with the same sample size parameter. The binomial case is contained in a known result about Bernoulli convolutions, the other two cases appear to be new. The emphasis of this paper is on providing a variety of different methods of proofs: (i) half monotone likelihood ratios, (ii) explicit coupling, (iii) Markov chain comparison, (iv) analytic calculation, and (v) comparison of Lévy measures. We give four proofs in the binomial case (methods (i)-(iv)) and three in the negative binomial case (methods (i), (iv) and (v)). The statement for hypergeometric distributions is proved via method (i). 2000 MSC: primary 60E15
منابع مشابه
Hessian Stochastic Ordering in the Family of multivariate Generalized Hyperbolic Distributions and its Applications
In this paper, random vectors following the multivariate generalized hyperbolic (GH) distribution are compared using the hessian stochastic order. This family includes the classes of symmetric and asymmetric distributions by which different behaviors of kurtosis in skewed and heavy tail data can be captured. By considering some closed convex cones and their duals, we derive some necessary and s...
متن کاملDispersive Ordering and k-out-of-n Systems
Extended Abstract. The simplest and the most common way of comparing two random variables is through their means and variances. It may happen that in some cases the median of X is larger than that of Y, while the mean of X is smaller than the mean of Y. However, this confusion will not arise if the random variables are stochastically ordered. Similarly, the same may happen if one would like to ...
متن کاملStochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کاملA multiple objective approach for joint ordering and pricing planning problem with stochastic lead times
The integration of marketing and demand with logistics and inventories (supply side of companies) may cause multiple improvements; it can revolutionize the management of the revenue of rental companies, hotels, and airlines. In this paper, we develop a multi-objective pricing-inventory model for a retailer. Maximizing the retailer's profit and the service level are the objectives, and shorta...
متن کاملEffects of Probability Function on the Performance of Stochastic Programming
Stochastic programming is a valuable optimization tool where used when some or all of the design parameters of an optimization problem are defined by stochastic variables rather than by deterministic quantities. Depending on the nature of equations involved in the problem, a stochastic optimization problem is called a stochastic linear or nonlinear programming problem. In this paper,a stochasti...
متن کامل